A Survey of Rollback-Recovery Protocols in Message-Passing Systems E.N. (MOOTAZ) ELNOZAHY IBM Research LORENZO ALVISI The University of Texas at Austin

Source URL: www.cs.utexas.edu

• Transaction processing
• Computing
• Fault-tolerant computer systems
• Data management
• Application checkpointing
• Data
• Rollback
• Database transaction
• Checkpoint
• Communication protocol
• Two-phase commit protocol

Distributed Snapshots: Determining Global States of Distributed Systems K. MANI CHANDY University of Texas at Austin and LESLIE LAMPORT

Source URL: lamport.azurewebsites.net

• Concurrent computing
• Distributed algorithms
• Concurrency
• Mathematics
• Computing
• Algorithm
• Mathematical logic
• Theoretical computer science
• Distributed computing
• Deadlock
• Chandy-Lamport algorithm
• Virtual synchrony

Module 3 : Promotion examples Press Releases Austin Public Library / Austin History Center: ​The History Center ​announces a special Family Day at the Archives. Birmingham Public Library: ​Press Release recruiting

Source URL: archive-it.org

• Oral history
• Maria Rogers Oral History Program
• Queens Memory Project
• Queens Library
• Public library
• Hennepin County Library
• Library
• New York City
• Education in the United States
• Geography of New York state)
• John Sessions Memorial Award

FIDEX: Filtering Spreadsheet Data using Examples Xinyu Wang Sumit Gulwani UT Austin, USA

Source URL: rishabhmit.bitbucket.io

• Computer programming
• Software engineering
• Formal languages
• Theoretical computer science
• Computing
• Directed acyclic graph
• Filter
• Regular expression
• Recursion
• Finite-state machine

Towards Algorithmic Synthesis of Synchronization for Shared-Memory Concurrent Programs Roopsha Samanta Computer Engineering Research Centre, The University of Texas at Austin.

Source URL: www.cs.purdue.edu

• Mathematics
• Formal languages
• Temporal logic
• Syntax
• Metalogic
• Logic
• Metaphilosophy
• Model theory
• Linear temporal logic
• Interpretation
• Computation tree logic
• Variable

Robustness Analysis of String Transducers? Roopsha Samanta1 , Jyotirmoy V. Deshmukh2?? , and Swarat Chaudhuri3 1 University of Texas at Austin 2

Source URL: www.cs.purdue.edu

• Finite automata
• Levenshtein distance
• Linguistics
• Theoretical computer science
• Finite-state transducer
• Mathematics
• Nested stack automaton

Industrial Use of ACL2: Applications, Achievements, Challenges, and Directions J Strother Moore and Marijn J.H. Heule Department of Computer Science The University of Texas at Austin {moore,marijn}@cs.utexas.edu

Source URL: www.cs.man.ac.uk

• Software engineering
• Computer programming
• Theoretical computer science
• Automated theorem proving
• Lisp
• ACL2
• Formal methods
• Logic in computer science
• Robert S. Boyer

A hybrid architecture for interactive verifiable computation Victor Vu, Srinath Setty, Andrew J. Blumberg, and Michael Walfish The University of Texas at Austin questions of the prover, and applies efficient tests to the

Source URL: www.pepper-project.org

Program Synthesis using Abstraction Refinement XINYU WANG, University of Texas at Austin, USA ISIL DILLIG, University of Texas at Austin, USA RISHABH SINGH, Microsoft Research, USA We present a new approach to example-gu

Source URL: rishabhmit.bitbucket.io

• Theoretical computer science
• Metaphysics
• Mathematical logic
• Temporal logic
• Computability theory
• Model theory
• Formal languages
• Finite-state machine
• Computation tree logic
• Abstraction
• Abstract interpretation
• IP

The Potential of Interference-Based Proof Systems Marijn J.H. Heule and Benjamin Kiesl The University of Texas at Austin and Vienna University of Technology ARCADE in Gothenburg, Sweden

Source URL: www.cs.utexas.edu

• Mathematical logic
• Mathematics
• Theoretical computer science
• Automated theorem proving
• Logic in computer science
• Methods of proof
• Boolean algebra
• Mathematical proofs
• Proof complexity
• Boolean satisfiability problem